Speeding Up GPU Graph Processing Using Structural Graph Properties
نویسندگان
چکیده
Edge Vertex Push Edge Edge The Problem: We want the fastest graph processing! • High-performance graph processing is very interesting for data science • High-performance computing is increasingly GPU/accelerator based • Mapping irregular (graph) algorithms to GPU is hard • Performance of irregular algorithms is data-dependent Thesis Goals • Quantify performance impact of data dependence • Model how performance relates to structural properties of the input graph • Predict best parallelisation strategy for a given graph and algorithm • Create an automated pipeline to repeat this work for new algorithms and parallelisation strategies
منابع مشابه
Speeding Up Network Layout and Centrality Measures for Social Computing Goals
This paper presents strategies for speeding up calculation of graph metrics and layout by exploiting the parallel architecture of modern day Graphics Processing Units (GPU), specifically Compute Unified Device Architecture (CUDA) by Nvidia. Graph centrality metrics like Eigenvector, Betweenness, Page Rank and layout algorithms like Fruchterman-Rheingold are essential components of Social Networ...
متن کاملSpeeding up Network Layout and Centrality Measures with NodeXL and the Nvidia CUDA Technology
In this paper we talk about speeding up calculation of graph metrics and layout with NodeXL by exploiting the parallel architecture of modern day Graphics Processing Units (GPU), specifically Compute Unified Device Architecture (CUDA) by Nvidia. Graph centrality metrics like Eigenvector, Betweenness, Page Rank and layout algorithms like Fruchterman-Rheingold are essential components of Social N...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملUsing Graph Properties to Speed-up GPU-based Graph Traversal: A Model-driven Approach
While it is well-known and acknowledged that the performance of graph algorithms is heavily dependent on the input data, there has been surprisingly little research to quantify and predict the impact the graph structure has on performance. Parallel graph algorithms, running on many-core systems such as GPUs, are no exception: most research has focused on how to efficiently implement and tune di...
متن کاملA Power Characterization and Management of GPU Graph Traversal
Graph analysis is a fundamental building block in numerous computing domains. Recent research has looked into harnessing GPUs to achieve necessary throughput goals. However, comparatively little attention has been paid to improving the power-constrained performance of these applications. Through firmware changes on a state-of-the-art commodity GPU, we characterize the power consumption of Bread...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017